Computability theory - PDFSEARCH.IO - Document Search Engine

Computability theory
Results: 1231

#	Item
991	Computability on topological spaces via domain representations Viggo Stoltenberg-Hansen Department of Mathematics, Uppsala University, Box 480, S[removed]Uppsala, Sweden Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2007-03-22 05:15:38 Functions and mappings Linear algebra Computability theory Abstract algebra Domain theory Computable function Viggo Stoltenberg-Hansen Algorithm Function Mathematics Algebra Mathematical structures
992	Axiomatising physical experiments as oracles to algorithms Edwin J. Beggsa , Jos´e F´elix Costab∗ , and John V. Tuckerc a Department of Mathematics, College of Sciences, Swansea University, Swansea SA2 8PP, Wales, Un Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2012-04-11 07:58:28 Computability theory Complexity classes Models of computation Alan Turing Oracle machine Turing reduction John V. Tucker Probabilistic Turing machine Reduction Theoretical computer science Applied mathematics Computational complexity theory
993	Newtonian systems, bounded in space, time, mass and energy can compute all functions1 E.J. Beggs2 and J.V. Tucker3 University of Wales Swansea, Singleton Park, Swansea, SA2 8PP, Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2005-09-20 12:52:16 Applied mathematics Computability theory Computable function John V. Tucker Hypercomputation Church–Turing thesis Classical mechanics Quantum computer Theoretical computer science Theory of computation Computer science
994	JOHN V TUCKER CLASSIFIED LIST OF PUBLICATIONS March 2013 My research publications can be classified under the following headings: Books Surveys Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2013-04-07 11:34:35 John V. Tucker Computer science Mathematics Theory of computation Computability theory Jan Bergstra Viggo Stoltenberg-Hansen Fellows of the British Computer Society Theoretical computer science Alumni of the University of Bristol
995	Embedding infinitely parallel computation in Newtonian kinematics E.J. Beggs a,1 J.V. Tucker b,2 a Department b Department Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2005-07-15 04:55:07 Applied mathematics Computability theory Models of computation Turing machine Hypercomputation Computable function John V. Tucker Computability Computation Theoretical computer science Computer science Theory of computation
996	12345efghi UNIVERSITY OF WALES SWANSEA REPORT SERIES Experimental computation of real numbers by Newtonian machines by Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2006-10-05 05:03:30 Computer science Applied mathematics Computable function John V. Tucker Hypercomputation Church–Turing thesis Classical mechanics Computable number Computability Theoretical computer science Theory of computation Computability theory
997	Computational complexity with experiments as oracles Edwin Beggs†, Jos´e F´elix Costa‡, Bruno Loff‡ & John Tucker† † School of Physical Sciences, Swansea University, Swansea, SA2 8PP, UK ‡ Instituto Superio Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2008-04-18 12:54:46 Computability theory Theory of computation Models of computation Turing machine Computable function Oracle machine Computability Computational complexity theory Algorithm Theoretical computer science Applied mathematics Computer science
998	Computations via experiments with kinematic systems1 E.J. Beggs2 and J.V. Tucker3 University of Wales Swansea, Singleton Park, Swansea, SA3 2HN, Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2004-03-16 05:09:52 Classical mechanics Computer science Applied mathematics Computable function Quantum mechanics Recursive set John V. Tucker Kinematics Computability Theory of computation Computability theory Physics
999	CiE Athens 2008 Applied Computability: A European Perspective J V Tucker Swansea University General Reflections on Models J V Tucker and J I Zucker, Abstract versus concrete computability: The case of countable Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2008-06-11 09:22:18 John V. Tucker Computer science Computability theory Logic Viggo Stoltenberg-Hansen Mathematical logic Computable function Computability Theoretical computer science Theory of computation Alumni of the University of Bristol

UPDATE